Processes on Unimodular Random Networks
نویسنده
چکیده
We investigate unimodular random networks. Our motivations include their characterization via reversibility of an associated random walk and their similarities to unimodular quasi-transitive graphs. We extend various theorems concerning random walks, percolation, spanning forests, and amenability from the known context of unimodular quasi-transitive graphs to the more general context of unimodular random networks. We give properties of a trace associated to unimodular random networks with applications to stochastic comparison of continuous-time random walk.
منابع مشابه
Dynamics on Unimodular Random Graphs
This paper is centered on covariant dynamics on random graphs and random networks (marked graphs), which can be described as rules to navigate the vertices that are preserved by graph/network isomorphisms. Such dynamics are referred to as vertex-shifts here. Unimodular random networks can be heuristically described as networks seen from a vertex chosen uniformly at random, both in the finite an...
متن کاملMathematical programming approaches for classes of random network problems
Random simulations from complicated combinatorial sets are often needed in many classes of stochastic problems. This is particularly true in the analysis of complex networks, where researchers are usually interested in assessing whether an observed network feature is expected to be found within families of networks under some hypothesis (named conditional random networks, i.e., networks satisfy...
متن کاملTwo Badly Behaved Percolation Processes on a Nonunimodular Graph
We provide nonunimodular counterexamples to two properties that are wellknown for automorphism invariant percolation on unimodular transitive graphs. The first property is that the number of encounter points in an infinite cluster is a.s. 0 or ∞. The second property is that speed of random walk on an infinite cluster is a.s. well-defined.
متن کاملExploiting total unimodularity for classes of random network problems
Network analysis is of great interest for the study of social, biological and technological networks, with applications, among others, in business, marketing, epidemiology and telecommunications. Researchers are often interested in assessing whether an observed feature in some particular network is expected to be found within families of networks under some hypothesis (named conditional random ...
متن کاملOn Fixation of Activated Random Walks
We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much more general processes on unimodular graphs. Roughly put, our result apply whenever the path of each particle has an automorphism invariant distribution and is...
متن کامل